Basic Gene Discretization-Model Using Correlation Clustering For Distributed DNA Databases
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملProtection of Privacy in Distributed Databases using Clustering
Clustering is the technique which discovers groups over huge amount of data, based on similarities, regardless of their structure (multi-dimensional or two dimensional). We applied an algorithm (DSOM) to cluster distributed datasets, based on self-organizing maps (SOM) and extends this approach presenting a strategy for efficient cluster analysis in distributed databases using SOM and Kmeans. T...
متن کاملConceptual Clustering of Heterogeneous Distributed Databases
With increasingly more databases becoming available on the Internet, there is a growing opportunity to globalise knowledge discovery and learn general patterns, rather than restricting learning to specific databases from which the rules may not be generalisable. Clustering of distributed databases facilitates learning of new concepts that characterise common features of, and differences between...
متن کاملD-GridMST: Clustering Large Distributed Spatial Databases
In this paper, we will propose a distributable clustering algorithm, called Distributed-GridMST (D-GridMST), which deals with large distributed spatial databases. D-GridMST employs the notions of multi-dimensional cube to partition the data space involved and uses density criteria to extract representative points from spatial databases, based on which a global MST of representatives is construc...
متن کاملAn Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is the formation of numerous zones in different sites based on corresponding user queries to the distributed database. Keywords, extracted out of the queries, are used to assign a range of values according to their corres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Networking and Applications
سال: 2020
ISSN: 0975-0290,0975-0282
DOI: 10.35444/ijana.2020.11055